Diagonal Peg Solitaire
نویسنده
چکیده
We study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing, and finish with one peg anywhere on the board. We then consider the problem of finding solutions that minimize the number of moves (where a move is one or more jumps by the same peg), and find the shortest solution to the “central game”, which begins and ends at the center. In some cases we can prove analytically that our solutions are the shortest possible, in other cases we apply A* or bidirectional search heuristics.
منابع مشابه
Solitaire Army and Related Games
In this paper I present some variations of the Solitaire Army game. This game is part of a broader category of one person games: Peg Solitaire games. While Central Solitaire is a relatively well-known and studied game, which is played on a cross-shaped board, little research has been done on Solitaire Army game and its variants. The purpose of this paper is to present Solitaire Army game, its v...
متن کاملTriangular Peg Solitaire Unlimited
Triangular peg solitaire is a well-known one-person game or puzzle. When one peg captures many pegs consecutively, this is called a sweep. We investigate whether the game can end in a dramatic fashion, with one peg sweeping all remaining pegs off the board. For triangular boards of side 6 and 8 (with 21 and 36 holes, respectively) the geometrically longest sweep can occur as the final move in a...
متن کاملInteger Programming Based Algorithms for Peg Solitaire Problems
Peg solitaire is a one player game using pegs and a board with some holes. The game is classical, and nowadays sold in many parts of the world under the trade name of Hi-Q. In this paper, we dealt with the peg solitaire problem as an integer programming problem. We proposed algorithms based on the backtrack search method and relaxation methods for integer programming problem. The algorithms fir...
متن کاملOne-Dimensional Peg Solitaire
We solve the problem of one-dimensional peg solitaire. In particular, we show that the set of configurations that can be reduced to a single peg forms a regular language, and that a linear-time algorithm exists for playing the game.
متن کاملA Combinatorial Approach to the Solitaire Game
The classical game of peg solitaire has uncertain origins, but was certainly popular by the time of Louis XIV, and was described by Leibniz in 1710. One of the classical problems concerning peg solitaire is the feasibility issue. An early tool used to show the infeasibility of various peg games is the rule-of-three [Suremain de Missery 1841]. In the 1960s the description of the solitaire cone [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/math/0606122 شماره
صفحات -
تاریخ انتشار 2006